How to Construct Pseudorandom Permutations from Single Pseudorandom Functions
نویسنده
چکیده
The paper examines permutation generators which are designed using four rounds of the Data Encryption Standard and a single pseudorandom function. We have proved that such generators are pseudorandom only if the pseudorandom function is used internally at least five times. The proof is given using two different approaches: deterministic and probabilistic. Some cryptographic implications are also discussed.
منابع مشابه
Indifferentiability beyond the Birthday Bound for the Xor of Two Public Random Permutations
Xoring two permutations is a very simple way to construct pseudorandom functions from pseudorandom permutations. The aim of this paper is to get precise security results for this construction when the two permutations on n bits f and g are public. We will first prove that f ⊕ g is indifferentiable from a random function on n bits when the attacker is limited with q queries, with q ≪ √ 2. This b...
متن کاملPseudorandom Function Tribe Ensembles Based on One-Way Permutations: Improvements and Applications
Pseudorandom function tribe ensembles are pseudorandom function ensembles that have an additional collision resistance property: almost all functions have disjoint ranges. We present an alternative to the construction of pseudorandom function tribe ensembles based on oneway permutations given by Canetti, Micciancio and Reingold [7]. Our approach yields two different but related solutions: One c...
متن کاملA Tweak for a PRF Mode of a Compression Function and Its Applications
We discuss a tweak for the domain extension called Merkle-Damg̊ard with Permutation (MDP), which was presented at ASIACRYPT 2007. We first show that MDP may produce multiple independent pseudorandom functions (PRFs) using a single secret key and multiple permutations if the underlying compression function is a PRF against related-key attacks with respect to the permutations. Using this result, w...
متن کاملA Note on Quantum-Secure PRPs
We show how to construct pseudorandom permutations (PRPs) that remain secure even if the adversary can query the permutation on a quantum superposition of inputs. Such PRPs are called quantum-secure. Our construction combines a quantum-secure pseudorandom function together with constructions of classical format preserving encryption. By combining known results, we obtain the first quantum-secur...
متن کاملSecurity in O(2n) for the Xor of Two Random Permutations \\ - Proof with the standard H technique -
Xoring two permutations is a very simple way to construct pseudorandom functions from pseudorandom permutations. In [14], it is proved that we have security against CPA-2 attacks when m O(2), where m is the number of queries and n is the number of bits of the inputs and outputs of the bijections. In this paper, we will obtain similar (but slightly different) results by using the “standard H tec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1990